Integers with a Large Smooth Divisor
نویسندگان
چکیده
We study the function Θ(x, y, z) that counts the number of positive integers n ≤ x which have a divisor d > z with the property that p ≤ y for every prime p dividing d. We also indicate some cryptographic applications of our results.
منابع مشابه
How to Find Smooth Parts of Integers
Let P be a finite set of primes, and let S be a finite sequence of positive integers. This paper presents an algorithm to find the largest P smooth divisor of each integer in S. The algorithm takes time b(lg b)2+o(1), where b is the total number of bits in P and S. A previous algorithm by the author takes time b(lg b)3+o(1) to find all the factors from P of each integer in S; a variant by Frank...
متن کاملMultiplicative Problems in Combinatorial Number Theory
In this thesis we look at several problems that lie in the intersection between combinatorial and multiplicative number theory. A common theme of many of these problems are estimates for and properties of the smooth numbers, those integers not divisible by any large prime factors. The first is the Ramsey-theoretic problem to determine the maximal size of a subset of the integers containing no 3...
متن کاملNonrational Del Pezzo Fibrations
In this paper we study cubic del Pezzo fibrations f : X → P such that the 3-fold X is smooth and rkPic(X) = 2. These are the examples of smooth 3-fold Mori fibre spaces. The 3-fold X is a divisor in the linear system |3M + nL| on the rational scroll Proj(⊕ i=1 OP1(di)), where n and di are integers, d1 ≥ d2 ≥ d3 ≥ d4 = 0, M is a tautological line bundle, and L is a fibre of the projection to P. ...
متن کاملSome applications of lattice based root finding techniques
In this paper we present some problems and their solutions exploiting lattice based root finding techniques. In CaLC 2001, Howgrave-Graham proposed a method to find the Greatest Common Divisor (GCD) of two large integers when one of the integers is exactly known and the other one is known approximately. In this paper, we present three applications of the technique. The first one is to show dete...
متن کاملConsecutive Integers with Equally Many Principal Divisors
Classifying the positive integers as primes, composites, and the unit, is so familiar that it seems inevitable. However, other classifications can bring interesting relationships to our attention. In that spirit, let us classify positive integers by the number of principal divisors they possess, where we define a principal divisor of a positive integer n to be any prime-power divisor pa|n which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007